An approximate dynamic programming approach to attended home delivery management
نویسندگان
چکیده
منابع مشابه
An Approximate Dynamic Programming Approach to Network Revenue Management
We develop an approximation algorithm for a dynamic capacity allocation problem with Markov modulated customer arrival rates. For each time period and each state of the modulating process, the algorithm approximates the dynamic programming value function using a concave function that is separable across resource inventory levels. We establish via computational experiments that our algorithm inc...
متن کاملTime Slot Management in Attended Home Delivery
Many e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to ensure satisfactory customer service. The choice of delivery time slots has to balance marketing and operational considerations, which results in a complex planning problem. We study the problem of selecting the set of time slots to offer in each of the zip codes in a service region. The s...
متن کاملAn approximate dynamic programming approach to solving dynamic oligopoly models
In this paper we introduce a new method to approximate Markov perfect equilibrium in large scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate best response operator using an approximate dynamic programming approach based on linear programming. W...
متن کاملAn Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a) the new heuristic produces high qu...
متن کاملAn approximate dynamic programming approach to convex quadratic knapsack problems
Quadratic knapsack problem (QKP) has a central role in integer and combinatorial optimization, while efficient algorithms to general QKPs are currently very limited. We present an approximate dynamic programming (ADP) approach for solving convex QKPs where variables may take any integer value and all coefficients are real numbers. We approximate the function value using (a) continuous quadratic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.06.034